A flexible motif search technique based on generalized profiles
نویسندگان
چکیده
منابع مشابه
A Flexible Motif Search Technique Based on Generalized Profiles
A flexible motif search technique is presented which has two major components: (1) a generalized profile syntax serving as a motif definition language; and (2) a motif search method specifically adapted to the problem of finding multiple instances of a motif in the same sequence. The new profile structure, which is the core of the generalized profile syntax, combines the functions of a variety ...
متن کاملA Flexible Motif Search Technique Based on Generalized Prooles
Draft Copy|January 24, 1996|Do not circulate. 0 abstract A exible motif search technique is presented which has two major components: 1. a generalized proole syntax serving as a motif deenition language 2. a motif search method speciically adapted to the problem of nding multiple instances of a motif in the same sequence. The new proole structure, which is the core of the generalized proole syn...
متن کاملA Flexible Skew-Generalized Normal Distribution
In this paper, we consider a flexible skew-generalized normal distribution. This distribution is denoted by $FSGN(/lambda _1, /lambda _2 /theta)$. It contains the normal, skew-normal (Azzalini, 1985), skew generalized normal (Arellano-Valle et al., 2004) and skew flexible-normal (Gomez et al., 2011) distributions as special cases. Some important properties of this distribution are establi...
متن کاملTowards Motif Detection in Networks: Frequency Concepts and Flexible Search
Network motifs, patterns of local interconnections with potential functional properties, are important for the analysis of biological networks. To analyse motifs in networks the first step is finding patterns of interest. This paper presents 1) three different concepts for the determination of pattern frequency and 2) a flexible algorithm to compute these frequencies. The different concepts of ...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Chemistry
سال: 1996
ISSN: 0097-8485
DOI: 10.1016/s0097-8485(96)80003-9